NP-hardness of the cluster minimization problem revisited
نویسندگان
چکیده
منابع مشابه
NP-hardness of the cluster minimization problem revisited
The computational complexity of the \cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)]. It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analog of the original problem is formulated, and a new proof fo...
متن کاملNP - Hardness of the Bandwidth Problem
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for-dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Zelikovs...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولProof of the NP-hardness of Topology Cuts problem
s.t. T = Tinit with xp ∈ {0, 1}, p ∈ V. Here V is the regular image grid domain, and E denotes the 4or 8neighborhood in the image. The terms of the above energy function have the form D(xp) = E1 p(1− xp) + E0 pxp and Vpq(xp, xq) = wpq((1 − xp)xq + (1 − xq)xp) with wpq ≥ 0. In the image domain, we consider the case that all the 0’s (foreground) are 4-connected and all the 1’s (background) are 8-...
متن کاملNP-Hardness of the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum diierence between the numbers of adjacent vertices is minimal. The problem has a long and varied history and is known to be NP-hard Papadimitriou Pa 76]. Recently for dense graphs a constant ratio approximation algorithm for this problem has been constructed in Karpinski, Wirtgen and Ze-likov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2005
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/38/40/001